WORST_CASE(?,O(n^1))

Solution:
---------

  "f" :: ["A"(15) x "A"(0)] -(1)-> "A"(0)
  "h" :: ["A"(0)] -(0)-> "A"(10)
  "h" :: ["A"(0)] -(0)-> "A"(15)
  "s" :: ["A"(0)] -(15)-> "A"(15)
  "s" :: ["A"(0)] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "f" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "h" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"h\"_A" :: ["A"(0)] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(0)] -(1)-> "A"(1)